Rational Approximation to |<i>x</i>| at Logarithmic Nodes
نویسندگان
چکیده
Based on a node group , the Newman type rational operator is constructed in paper. The convergence rate of approximation to class non-smooth functions discussed, which regarding X. Moreover, if based further subdivision nodes, . result this paper superior results equidistant Chebyshev nodes first kind and second kind.
منابع مشابه
Barycentric rational interpolation at quasi-equidistant nodes
A collection of recent papers reveals that linear barycentric rational interpolation with the weights suggested by Floater and Hormann is a good choice for approximating smooth functions, especially when the interpolation nodes are equidistant. In the latter setting, the Lebesgue constant of this rational interpolation process is known to grow only logarithmically with the number of nodes. But ...
متن کاملRational Approximation
Recently several authors have investigated the question of approximating certain functions by reciprocals of polynomials under the uniform norm on the positive real axis . Perhaps these results have some applications in industry and elsewhere (cf. [1, 36]) . Our present motivation is to give a detailed list of all the known results with simplified proofs in some cases and many new results and f...
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملIntegration of Rational Functions: Rational Computation of the Logarithmic Part
This formula is not satisfactory under a computing point of view because it introduces more algebraic quantities than necessary. The number P(a)/Q'(a) is called the residue of the root a of Q. We introduce the notion of multiplicity of a residue b that is the number of roots a having b as a residue. Trager (1976) introduced a new formula involving less algebraic numbers: let S(y) be the resulta...
متن کاملGeneralized Rational Krylov Decompositions with an Application to Rational Approximation
Generalized rational Krylov decompositions are matrix relations which, under certain conditions, are associated with rational Krylov spaces. We study the algebraic properties of such decompositions and present an implicit Q theorem for rational Krylov spaces. Transformations on rational Krylov decompositions allow for changing the poles of a rational Krylov space without recomputation, and two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Pure Mathematics
سال: 2021
ISSN: ['2160-0368', '2160-0384']
DOI: https://doi.org/10.4236/apm.2021.111003